Some New Symmetric Block Designs EDWARD
نویسنده
چکیده
In his book [I 1, Marshall Hall gives a table of balanced incomplete block designs with from 3 to 15 replications. It is mentioned there that a solution is unknown as to whether or not there exists a symmetric block design with parameters (v, k, h) = (36, 15, 6) (number 104 in the table). It is the purpose of this paper to show that such a design can in fact be constructed quite simply and to suggest that a more general construction might exist for designs with parameters (0, k, A) = (4u2, 2u2 u, u2 u). The above design is obtained by taking u = 3. In the case u = 2’ such designs have already been constructed [2], the designs being in fact group difference sets.
منابع مشابه
Automorphism Group of a Possible 2-(121, 16, 2) Symmetric Design
Let D be a symmetric 2-(121, 16, 2) design with the automorphism group of Aut(D). In this paper the order of automorphism of prime order of Aut(D) is studied, and some results are obtained about the number of fixed points of these automorphisms. Also we will show that |Aut(D)|=2p 3q 5r 7s 11t 13u, where p, q, r, s, t and u are non-negative integers such that r, s, t, u ? 1. In addition we prese...
متن کاملSome Optimal Codes From Designs
The binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. A new method is also introduced to study optimal codes.
متن کاملBalanced nested designs and balanced arrays
Balanced nested designs are closely related to other combinatorial structures such as balanced arrays and balanced n-ary designs. In particular, the existence of symmetric balanced nested designs is equivalent to the existence of some balanced arrays. In this paper, various constructions for symmetric balanced nested designs are provided. They are used to determine the spectrum of symmetric bal...
متن کاملOn the Orbits of Collineation Groups
1. Introduction In this paper we consider some results on the orbits of groups of collineations, or, more generally, on the point and block classes of tactical decompositions, on symmetric balanced incomplete block designs (symmetric BIBD = (v, k, 2)-system=finite 2-plane), and we consider generalizations to (not necessarily symmetric) BIBD and other combinatorial designs. The results are about...
متن کاملA computer approach to the enumeration of block designs which are invariant with respect to a prescribed permutation group
We present a new approach to the construction of simple block designs. Using the computer package DISCRETA, we start with the construction of block designs which are invariant with respect to some prescribed group of automorphisms. Therefore, one applies the method of Kramer and Mesner which means that one has to solve systems of diophantine equations to get the designs. DISCRETA has proven its...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003